Continuous-time versus discrete-time approaches for scheduling of chemical processes: a review
نویسندگان
چکیده
An overview of developments in the scheduling of multiproduct/multipurpose batch and continuous processes is presented. Existing approaches are classified based on the time representation and important characteristics of chemical processes that pose challenges to the scheduling problem are discussed. In contrast to the discrete-time approaches, various continuous-time models have been proposed in the literature and their strengths and limitations are examined. Computational studies and applications are presented. The important issues of incorporating scheduling at the design stage and scheduling under uncertainty are also reviewed. © 2004 Elsevier Ltd. All rights reserved.
منابع مشابه
Polyhedral results for discrete-time production planning MIP formulations for continuous processes
We develop a series of polyhedral results for the widely used discrete-time mixedinteger programming (MIP) formulations for production planning and scheduling of continuous processes. We show that for a set of special cases, the incidence matrices of these problems are totally unimodular or network matrices. We also present how these results can be used to facilitate the effective solution of a...
متن کاملState-of-the Art in Short-Term, Medium-Term, and Reactive Scheduling for Large-Scale Batch and Continuous Processes
Scheduling is a decision making process to determine when, where, how to produce a set of products given requirements in a specific time horizon, a set of limited resources, and processing recipes. The research area of batch and continuous process scheduling has received great attention from both the academia and the industry in the past two decades. This is motivated by the increasing pressure...
متن کاملMixed Integer Linear Programming in Process Scheduling: Modeling, Algorithms, and Applications
This paper reviews the advances of mixed-integer linear programming (MILP) based approaches for the scheduling of chemical processing systems. We focus on the short-term scheduling of general network represented processes. First, the various mathematical models that have been proposed in the literature are classified mainly based on the time representation. Discrete-time and continuous-time mod...
متن کاملA novel technique for a class of singular boundary value problems
In this paper, Lagrange interpolation in Chebyshev-Gauss-Lobatto nodes is used to develop a procedure for finding discrete and continuous approximate solutions of a singular boundary value problem. At first, a continuous time optimization problem related to the original singular boundary value problem is proposed. Then, using the Chebyshev- Gauss-Lobatto nodes, we convert the continuous time op...
متن کاملScheduling of job shop, make-to-order industries with recirculation and assembly: discrete versus continuous time models
This work studies the performance of two Mixed Integer Linear Programming (MILP) models to solve scheduling problems in a flexible job shop environment with recirculation and assembly using a due-date-based objective function. The models convey different approaches both in the modelling of time (discrete and continuous approaches) as well as in the assignment of jobs to machines. The comparison...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computers & Chemical Engineering
دوره 28 شماره
صفحات -
تاریخ انتشار 2004